A Distance-Preserving Matrix Sketch
نویسندگان
چکیده
Visualizing very large matrices involves many formidable problems. Various popular solutions to these problems involve sampling, clustering, projection, or feature selection reduce the size and complexity of original task. An important aspect methods is how preserve relative distances between points in higher-dimensional space after reducing rows columns fit a lower dimensional space. This because conclusions based on faulty visual reasoning can be harmful. Judging dissimilar as similar basis visualization lead false conclusions. To ameliorate this bias make visualizations datasets feasible, we introduce two new algorithms that, respectively, select subset rectangular matrix. designed closely possible. We compare our matrix sketch more traditional alternatives variety artificial real datasets. Supplementary materials for article are available online.
منابع مشابه
On the distance from a matrix polynomial to matrix polynomials with two prescribed eigenvalues
Consider an n × <span style="fon...
متن کاملOn Distance Preserving and Sequentially Distance Preserving Graphs
A graph H is an isometric subgraph of G if dH(u, v) = dG(u, v), for every pair u, v ∈ V (H). A graph is distance preserving if it has an isometric subgraph of every possible order. A graph is sequentially distance preserving if its vertices can be ordered such that deleting the first i vertices results in an isometric subgraph, for all i ≥ 1. We give an equivalent condition to sequentially dist...
متن کاملDistance-Preserving Graph Contractions
Compression and sparsification algorithms are frequently applied in a preprocessing step before analyzing or optimizing large networks/graphs. In this paper we propose and study a new framework for contracting edges of a graph (merging vertices into super-vertices) with the goal of preserving pairwise distances as accurately as possible. Formally, given an edge-weighted graph, the contraction s...
متن کاملSketch-based Collaborative Interactive Implicit Modelling at a Distance
With the increased complexity in state of the art models created using common digital content creation applications, such as AutoCAD, Maya or XSI, the need to have more than one person work on a single model is common. Ideally people would work on the same model at the same time, from several workstations possibly at distant locations. Using a mesh based modelling approach requires synchronizin...
متن کاملA Symmetry Preserving Algorithm for Matrix Scaling
We present an iterative algorithm which asymptotically scales the ∞-norm of each row and each column of a matrix to one. This scaling algorithm preserves symmetry of the original matrix and shows fast linear convergence with an asymptotic rate of 1/2. We discuss extensions of the algorithm to the one-norm, and by inference to other norms. For the 1-norm case, we show again that convergence is l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Graphical Statistics
سال: 2022
ISSN: ['1061-8600', '1537-2715']
DOI: https://doi.org/10.1080/10618600.2022.2050246